Generalized Laplacian Eigenvalues of Random Hypergraphs
نویسنده
چکیده
This is a sequel to an accepted talk of WAW 2011, where we introduced a set of generalized Laplacians of hypergraphs through the high-ordered random walks. In that paper, we proved the eigenvalues of these Laplacians can effectively control the mixing rate of highordered random walks, the generalized distances/diameters, and the edge expansions. In this talk, we will give a preliminary report on the Laplacian spectral radius of complete hypergraphs and random hypergraphs. Joint work with Xing Peng.
منابع مشابه
The clique and coclique numbers’ bounds based on the H-eigenvalues of uniform hypergraphs
In this paper, some inequality relations between the Laplacian/signless Laplacian H-eigenvalues and the clique/coclique numbers of uniform hypergraphs are presented. For a connected uniform hypergraph, some tight lower bounds on the largest Laplacian H+-eigenvalue and signless Laplacian H-eigenvalue related to the clique/coclique numbers are given. And some upper and lower bounds on the clique/...
متن کاملLoose laplacian spectra of random hypergraphs
Let H = (V , E) be an r-uniform hypergraph with the vertex set V and the edge set E. For 1 ≤ s ≤ r/2, we define a weighted graph G(s) on the vertex set (Vs) as follows. Every pair of s-sets I and J is associated with a weight w(I , J), which is the number of edges in H containing I and J if I ∩ J = ∅, and 0 if I ∩ J = ∅. The s-th Laplacian L(s) of H is defined to be the normalized Laplacian of ...
متن کاملHigh-Ordered Random Walks and Generalized Laplacians on Hypergraphs
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated hypergraphs as weighted graphs and then studied the Laplacians of the corresponding weighted graphs. In this paper, we aim to unify these ve...
متن کاملEla Spectral Properties of Oriented Hypergraphs
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of +1 or −1. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian matrices of an oriented hypergraph which depend on structural parameters of the oriented hypergraph are found. An oriented hypergraph and its incidence dual are ...
متن کاملEigenvalues of Transmission Graph Laplacians
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a “transmission” system. A transmission system is a mathematical representation of a means of transmitting (multi-parameter) data along directed edges from vertex to vertex. The associated transmission graph Laplacian is shown to have many of the former properties of the classica...
متن کامل